BLUE: A New Class of Active Queue Management Algorithms

نویسندگان

  • Wu-chang Feng
  • Dilip D. Kandlur
  • Debanjan Saha
  • Kang G. Shin
چکیده

In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF is considering the deployment of active queue management techniques such as RED [13]. While active queue management can potentially reduce packet loss rates in the Internet, this paper shows that current techniques are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use queue lengths as the indicator of the severity of congestion. In light of this observation, a fundamentally different active queue management algorithm called BLUE is proposed. BLUE uses packet loss and link idle events to manage congestion. Using simulation and controlled experiments, BLUE is shown to perform significantly better than RED both in terms of packet loss rates and buffer size requirements in the network. As an extension to BLUE, a novel technique for enforcing fairness among a large number of flows is described. In particular, this paper proposes and evaluates Stochastic Fair BLUE (SFB), a queue management algorithm which can identify and rate-limit non-responsive flows using a very small amount of state information.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of Active Queue Management Algorithms

Active Queue Management (AQM) is a very active research area in networking flows. In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, researchers have been considering the deployment of active queue management algorithms. In this paper we will evaluate the active queue management algorithms such as Droptail, RED, BLUE, REM, GREEN and PURPLE. T...

متن کامل

Implementation and Evaluation of the Blue Active Queue Management Algorithm

This work documents the implementation of the BLUE Active Queue Management algorithm for the Linux Operating System and its evaluation by measurements. The issues of Active Queue Management (AQM), and the search for the most adequate AQM algorithms are important in these days because of the changing traffic dynamics – mostly congestion – on the Internet, and the rising quality expectations held...

متن کامل

Anakyzing the performance of Active Queue Management Algorithms

Congestion is an important issue which researchers focus on in the Transmission Control Protocol (TCP) network environment. To keep the stability of the whole network, congestion control algorithms have been extensively studied. Queue management method employed by the routers is one of the important issues in the congestion control study. Active queue management (AQM) has been proposed as a rou...

متن کامل

An Improvement over Random Early Detection Algorithm: A Self-Tuning Approach

Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...

متن کامل

Study of Active Queue Management Algorithms

The focus of this work is to study the behaviors of varies queue managements, including RED (Random Early Detection), SRED (Stabilized-RED), and BLUE. The performance metrics of the comparison are queue size, the drop probability, and link utilization. The simulation is done using NS-2. The results of this work shows that different from the RED, SRED and BLUE, which use the available queue leng...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999